A Self-Concordant Interior Point Approach for Optimal Control with State Constraints
نویسندگان
چکیده
We propose an infeasible interior point method for pointwise state constrained optimal control problems with linear elliptic PDEs. A smoothed constraint violation functional is used to develop a self-concordant barrier approach in an infinite-dimensional setting. We provide a detailed convergence analysis in function space for this approach. The quality of the smoothing is described by a parameter. By fixing this parameter we obtain a perturbed version of the original problem. We establish complexity estimates and convergence rates for the methods that we propose to solve a given perturbed problem. We also estimate the distance between the optimal solution of the perturbed problem and the optimal solution of the original problem. Moreover, our approach yields a rigorous measure for the proximity of the actual iterate to the minimizer of the perturbed and the original problems. We report on numerical experiments to illustrate efficiency and mesh independence.
منابع مشابه
Self-Concordant Barriers for Convex Approximations of Structured Convex Sets
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the approximation is moderate) self-concordant barriers. This approach extends the reach of the modern theory of interior-point methods, and lays the foundation for new ways to treat structured convex optimization problems w...
متن کاملLocal Self-concordance of Barrier Functions Based on Kernel-functions
Many efficient interior-point methods (IPMs) are based on the use of a self-concordant barrier function for the domain of the problem that has to be solved. Recently, a wide class of new barrier functions has been introduced in which the functions are not self-concordant, but despite this fact give rise to efficient IPMs. Here, we introduce the notion of locally self-concordant barrier functio...
متن کاملAn Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O∗( √ T ) regret. The setting is a natural generalization of the non-stochastic multi-armed bandit problem, and the existence of an efficient optimal algorithm has been posed as an open problem in a number of recent papers. We show how the difficulties encountered b...
متن کاملCompeting in the Dark: An Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O∗( √ T ) regret. The setting is a natural generalization of the nonstochastic multi-armed bandit problem, and the existence of an efficient optimal algorithm has been posed as an open problem in a number of recent papers. We show how the difficulties encountered by...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Journal on Optimization
دوره 25 شماره
صفحات -
تاریخ انتشار 2015